Idle regulation in non-clairvoyant scheduling of parallel jobs
نویسندگان
چکیده
منابع مشابه
Idle regulation in non-clairvoyant scheduling of parallel jobs
The optimization of parallel applications is difficult to achieve by classical optimization techniques because of their diversity and the variety of actual parallel and distributed platforms and/or environments. Adaptive algorithmic schemes, capable of dynamically changing the allocation of jobs during the execution to optimize global system behavior, are the best alternatives for solving this ...
متن کاملNon-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics
A multiprocessor system is unlikely to have access to information about the execution characteristics of the jobs it is to schedule. In this work, we are interested in scheduling algorithms for batch jobs that require no such knowledge (such algorithms are called non-clairvoyant). Preemptive scheduling (i.e., redistribution of processors) is important to reduce mean response time in multiproces...
متن کاملNon-clairvoyant Scheduling of Batched Parallel Jobs to Minimize Mean Response Time
This paper presents a new scheduling algorithm RAD, and shows that RAD efficiently schedules batched parallel jobs on multiprocessors. An early result by Deng et al. shows that Dynamic Equi-partitioning is 4-competitive for mean response time when the number of jobs is not more than the number of processors. Then, in STOC 97, Edmonds et al. show that the mean response time obtained by Equi-part...
متن کاملOnline Scheduling of Multiprocessor Jobs with Idle Regulation
In this paper, we focus on on-line scheduling of multiprocessor jobs with emphasis on the regulation of idle periods in the frame of general list policies. We consider a new family of scheduling strategies based on two phases which successively combine sequential and parallel executions of the jobs. These strategies are part of a more generic scheme introduced in [6]. The main result is to demo...
متن کاملScheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs
An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.03.005